Compositional analysis for regularity, liveness and boundedness
نویسنده
چکیده
By the linear algebraic representation of Petri nets, Desel introduced regularity property (Desel, 1992). Regularity implies a sufficient condition for a Petri net to be live and bounded. All the conditions checking the regularity of a Petri net are decidable in polynomial time in the size of a net (Desel and Esparza, 1995). This paper proves that regularity, liveness and boundedness can be preserved after applying many compositional operations to Petri nets. This means that, by applying these compositional operations, a designer can construct complex nets satisfying regularity, liveness and boundedness properties from simpler ones without forward analysis.
منابع مشابه
On Compositionality of Boundedness and Liveness for Nested Petri Nets
Nested Petri nets (NP-nets) are Petri nets with net tokens. The liveness and boundedness problems are undecidable for two-level NP-nets [10]. Boundedness is EXPSPACE and liveness is EXPSPACE or worse for plain Petri nets [4]. However, for some restricted classes, e.g. for plain free-choice Petri nets, problems become more amenable to analysis. There is the polynomial time algorithm to check if ...
متن کاملCompositional Synthesis of Distributed System Components based on Augmented marked Graphs
ABSTRACT Augmented marked graphs possess a special structure for modelling common resources as well as some desirable properties pertaining to liveness, boundedness, reversibility and conservativeness. This paper investigates the property-preserving composition of augmented marked graphs for the synthesis of distributed systems. It is proposed that distributed system components are specified as...
متن کاملTiming-dependent boundedness and liveness in continuous Petri nets
The very classical structural boundedness and repetitiveness properties for discrete and untimed models are reconsidered for timed continuous Petri nets (TCPN), under infinite server semantics. The timing is here involved in the analysis, by taking advantage of its matricial characterization and properties analogous to conservativeness and consistency are defined. It is shown that such properti...
متن کاملPolynomial-Time Manz-One Reductions for Petri Nets
We apply to Petri net theory the technique of polynomialtime many-one reductions. We study boundedness, reachability, deadlock, liveness problems and some of their variations. We derive three main results. Firstly, we highlight the power of expression of reachability which can polynomially give evidence of unboundedness. Secondly, we prove that reachability and deadlock are polynomially-time eq...
متن کاملC . Dufourd and A . Finkel Polynomial many − one reductions for Petri nets
We apply to Petri net theory the technique of polynomial-time many-one reductions. We study boundedness, reachability, deadlock , liveness problems and some of their variations. We derive three main results. Firstly, we highlight the power of expression of reachability which can polynomially give evidence of unboundedness. Secondly, we prove that reachability and deadlock are polynomially-time ...
متن کامل